Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
نویسندگان
چکیده
We describe the implementation of algorithms to construct and maintain threedimensional dynamic Delaunay triangulations with kinetic vertices using a threesimplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tessellation. Initially, a given list of points is triangulated. Time evolution of the triangulation is not only governed by kinetic vertices but also by a changing number of vertices. We use three-dimensional simplex flip algorithms, a stochastic visibility walk algorithm for point location and in addition, we propose a new simple method of deleting vertices from an existing three-dimensional Delaunay triangulation while maintaining the Delaunay property. The dual Dirichlet tessellation can be used to solve differential equations on an irregular grid, to define partitions in cell tissue simulations, for collision detection etc.
منابع مشابه
Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery
In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments that constrain the edges of the triangulation, while still maintaining most of the favorable properties of ordinary Delaunay triangulations (such as maximizing the minimum angle). CDTs solve the problem of enforcing boundary conformity—ensuring that triangulation edges cover the boundaries (both interior an...
متن کاملDynamic Delaunay tetrahedralizations and Voronoi tessellations in three dimensions
We describe the implementation of an incremental insertion algorithm to construct and maintain three-dimensional Delaunay triangulations with dynamic vertices using a three-simplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tesselation. A given list of generators is triangulated and volumes as well as contact surfaces of the Dirichlet region...
متن کاملConstruction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations
We propose a new mesh refinement algorithm for computing quality guaranteed Delaunay triangulations in three dimensions. The refinement relies on new ideas for computing the goodness of the mesh, and a sampling strategy that employs numerically stable Steiner points. We show through experiments that the new algorithm results in sparse well-spaced point sets which in turn leads to tetrahedral me...
متن کامل1A.4 Construction of Sparse Well-spaced Point Sets for Quality Tetrahedralizations
We propose a new mesh refinement algorithm for computing quality guaranteed Delaunay triangulations in three dimensions. The refinement relies on new ideas for computing the goodness of the mesh, and a sampling strategy that employs numerically stable Steiner points. We show through experiments that the new algorithm results in sparse well-spaced point sets which in turn leads to tetrahedral me...
متن کاملCollars and Intestines: Practical Conforming Delaunay Refinement
While several existing Delaunay refinement algorithms allow acute 3D piecewise linear complexes as input, algorithms producing conforming Delaunay tetrahedralizations (as opposed to constrained or weighted Delaunay tetrahedralizations) often involve cumbersome constructions and are rarely implemented. We describe a practical construction for both “collar” and “intestine”-based approaches to thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Physics Communications
دوره 162 شماره
صفحات -
تاریخ انتشار 2004